ar X iv : m at h / 05 06 24 2 v 3 [ m at h . C O ] 1 7 Fe b 20 06 REDUCED DECOMPOSITIONS AND PERMUTATION PATTERNS
نویسنده
چکیده
Billey, Jockusch, and Stanley characterized 321-avoiding permutations by a property of their reduced decompositions. This paper generalizes that result with a detailed study of permutations via their reduced decompositions and the notion of pattern containment. These techniques are used to prove a new characterization of vexillary permutations in terms of their principal dual order ideals in a particular poset. Additionally, the combined frameworks yield several new results about the commutation classes of a permutation. In particular, these describe structural aspects of the corresponding graph of the classes and the zonotopal tilings of a polygon defined by Elnitsky that is associated with the permutation.
منابع مشابه
ar X iv : m at h / 05 06 24 2 v 1 [ m at h . C O ] 1 3 Ju n 20 05 REDUCED DECOMPOSITIONS AND PERMUTATION PATTERNS
Billey, Jockusch, and Stanley characterized 321-avoiding permutations by a property of their reduced decompositions. This paper generalizes that result with a detailed study of permutations via their reduced decompositions and the notion of pattern containment. These techniques are used to prove a new characterization of vexillary permutations in terms of their principal dual order ideals in a ...
متن کاملar X iv : m at h / 05 06 24 2 v 2 [ m at h . C O ] 1 2 Ju l 2 00 5 REDUCED DECOMPOSITIONS AND PERMUTATION PATTERNS
Billey, Jockusch, and Stanley characterized 321-avoiding permutations by a property of their reduced decompositions. This paper generalizes that result with a detailed study of permutations via their reduced decompositions and the notion of pattern containment. These techniques are used to prove a new characterization of vexillary permutations in terms of their principal dual order ideals in a ...
متن کاملColourings of cubic graphs inducing isomorphic monochromatic subgraphs
A k–bisection of a bridgeless cubic graph G is a 2–colouring of its vertex set such that the colour classes have the same cardinality and all connected components in the two subgraphs induced by the colour classes (monochromatic components in what follows) have order at most k. Ban and Linial conjectured that every bridgeless cubic graph admits a 2–bisection except for the Petersen graph. A sim...
متن کاملFinding small patterns in permutations in linear time
Given two permutations σ and π, the Permutation Pattern problem asks if σ is a subpattern of π. We show that the problem can be solved in time 2 2 log `) ·n, where ` = |σ| and n = |π|. In other words, the problem is fixed-parameter tractable parameterized by the size of the subpattern to be found. We introduce a novel type of decompositions for permutations and a corresponding width measure. We...
متن کاملReduced Decompositions with One Repetition and Permutation Pattern Avoidance
In 2007, Tenner established a connection between pattern avoidance in permutations and the Bruhat order on permutations by showing that the downset of a permutation in the Bruhat order is a Boolean algebra if and only if the permutation is 3412 and 321 avoiding. Tenner mentioned, but did not prove, that if the permutation is 321 avoiding and contains exactly one 3412 pattern, or if the permutat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008